Combinatorial Optimization Problems in Power Systems
نویسندگان
چکیده
منابع مشابه
Approximability of Combinatorial Optimization Problems on Power Law Networks
One of the central parts in the study of combinatorial optimization is to classify the NP-hard optimization problems in terms of their approximability. In this thesis we study the Minimum Vertex Cover (Min-VC) problem and the Minimum Dominating Set (Min-DS) problem in the context of so called power law graphs. This family of graphs is motivated by recent findings on the degree distribution of e...
متن کاملCombinatorial Problems in Compiler Optimization
Several important compiler optimizations such as instruction scheduling and register allocation are fundamentally hard and are usually solved using heuristics or approximate solutions. In contrast, this thesis examines optimal solutions to three combinatorial problems in compiler optimization. The first problem addresses instruction scheduling for clustered architectures, popular in embedded sy...
متن کاملA Study of Combinatorial Optimization Problems in Industrial Computer Systems
A combinatorial optimization problem is an optimization problem where the number of possible solutions are finite and grow combinatorially with the problem size. Combinatorial problems exist everywhere in industrial systems. This thesis focuses on solving three such problems which arise within two different areas where industrial computer systems are often used. Within embedded systems and real...
متن کاملwind farm impact on generation adequacy in power systems
در سال های اخیر به دلیل افزایش دمای متوسط کره زمین، بشر به دنبال روش های جایگزین برای تامین توان الکتریکی مورد نیاز خود بوده و همچنین در اکثر نقاط جهان سوزاندن سوخت های فسیلی در نیروگاه های حرارتی به عنوان مهم ترین روش تولید توان الکتریکی مطرح بوده است. به دلیل توجه به مسایل زیست محیطی، استفاده از منابع انرژی تجدید پذیر در سال های اخیر شدت یافته است. نیروگاه های بادی به عنوان یک منبع تولید توان...
15 صفحه اولOn Solving Combinatorial Optimization Problems
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Power and Energy
سال: 1994
ISSN: 0385-4213,1348-8147
DOI: 10.1541/ieejpes1990.114.4_331